Category: algorithms & architectures, Preference: oral Support Vector Machines for Regression Problems with Sequential Minimal Optimization
نویسنده
چکیده
Training a support vector machine (SVM) is usually done by mapping the underlying optimization problem into a quadratic programming (QP) problem. Unfortunately, high quality QP solvers are not readily available, which makes research into the area of SVMs difficult for the those without a QP solver. Recently, the Sequential Minimal Optimization algorithm (SMO) was introduced [1, 2]. SMO reduces SVM training down to a series of smaller QP subproblems that have an analytical solution and, therefore, does not require a general QP solver. SMO has been shown to be very efficient for classification problems using linear SVMs and/or sparse data sets. This work shows how SMO can be generalized to handle regression problems.
منابع مشابه
Fast training of support vector machines on the Cell processor
Support Vector Machines (SVMs) are a widely used technique for classification, clustering and data analysis. While efficient algorithms for training SVM are available, dealing with large datasets makes training and classification a computationally challenging problem. In this paper we exploit modern processor architectures to improve the training speed of LIBSVM, a well known implementation of ...
متن کاملActive-Set Methods for Support Vector Machines
This chapter describes an active-set algorithm for the solution of quadratic programming problems in the context of Support Vector Machines (SVMs). Most of the common SVM optimizers implement working-set algorithms like the SMO method because of their ability to handle large data sets. Although they show generally good results, they may perform weakly in some situations, e.g., if the problem is...
متن کاملOptimized Training of Support Vector Machines on the Cell Processor
Support Vector Machines (SVMs) are a widely used technique for classification, clustering and data analysis. While efficient algorithms for training SVMs are available, dealing with large datasets makes training and classification a computationally challenging problem. In this paper we exploit modern processor architectures to improve the training speed of LIBSVM, a well known software tool whi...
متن کاملOn the equality of kernel AdaTron and sequential minimal optimization in classification and regression tasks and alike algorithms for kernel machines
The paper presents the equality of a kernel AdaTron (KA) method (originating from a gradient ascent learning approach) and sequential minimal optimization (SMO) learning algorithm (based on an analytic quadratic programming step) in designing the support vector machines (SVMs) having positive definite kernels. The conditions of the equality of two methods are established. The equality is valid ...
متن کاملSymmetric and antisymmetric properties of solutions to kernel-based machine learning problems
A particularly interesting instance of supervised learning with kernels is when each training example is associated with two objects, as in pairwise classification (Brunner et al., 2012), and in supervised learning of preference relations (Herbrich et al., 1998). In these cases, one may want to embed additional prior knowledge into the optimization problem associated with the training of the le...
متن کامل